package Test;

public class NineteenTest {
    class Solution {
        public int[] searchRange(int[] nums, int target) {
            int[] ret = new int[2];
            ret[0] = ret[1] = -1;
            //处理边界条件
            if(nums.length == 0)return ret;
            //1.先找区间左端点
            int left = 0,right = nums.length - 1;
            while(left < right){
                int mid = left + (right - left)/2;
                if(nums[mid] <target )left = mid+1;
                else right = mid;
            }
            //判断是否等于要找的数据
            if(nums[left] != target) return ret;
            else ret[0] = right;
            //2.找区间的右端点
            left = 0;right = nums.length - 1;
            while(left < right){
                int mid = left + (right - left + 1)/2;
                if(nums[mid] <= target) left = mid;
                else right = mid- 1;
            }
            ret[1] = left;
            return ret;
        }
    }
}
